Computers with closed timelike curves can solve hard problems
نویسنده
چکیده
A computer which has access to a closed timelike curve, and can thereby send the results of calculations into its own past, can exploit this to solve difficult computational problems efficiently. I give a specific demonstration of this for the problem of factoring large numbers, and argue that a similar approach can solve NP-complete and PSPACE-complete problems. I discuss the potential impact of quantum effects on this result.
منابع مشابه
Computability Theory of Closed Timelike Curves
We ask, and answer, the question of what’s computable by Turing machines equipped with time travel into the past: that is, closed timelike curves or CTCs (with no bound on their size). We focus on a model for CTCs due to Deutsch, which imposes a probabilistic consistency condition to avoid grandfather paradoxes. Our main result is that computers with CTCs can solve exactly the problems that are...
متن کاملClosed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas. In this paper we show that if CTCs existed, then quantum computers would be no more powerful than classical computers: both would have the (extremely large) power of the complexity class PSPACE, consisting of all prob...
متن کاملMust Time Machine Be Unstable against Vacuum Fluctuations ?
In the appearance of absorption material, the quantum vacuum fluctuations of all kinds of fields may be smoothed out and the spacetime with time machine may be stable against vacuum fluctuations. The chronology protection conjecture might break down, and the anti-chronology protection conjecture might hold: There is no law of physics preventing the appearance of closed timelike curves. PACS num...
متن کاملClosed Timelike Curves
In this paper, we explore the possibility that closed timelike curves might be allowed by the laws of physics. A closed timelike curve is perhaps the closest thing to time travel that general relativity allows. We will begin our discussing just what closed timelike curves are, and in what kinds of contexts they were first shown to appear. We then explore how one might actually travel on a close...
متن کاملTime Travel: A New Hypercomputational Paradigm
Assuming that all objections to time travel are set aside it is shown that a com putational system with closed timelike curves is a powerful hypercomputational tool Speci cally such a system allows us to solve four out of ve problems recently advanced as counterexamples to the fundamental principle of universality in computation The fth counterexample however remains unassailable indicating tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره gr-qc/0209061 شماره
صفحات -
تاریخ انتشار 2002